import java.util.*;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * user:likai
 * Date:2022-11-05
 * Time:10:07
 */
class Node {
    int val;
    Node next;
    Node random;

    public Node(int val) {
        this.val = val;
        this.next = null;
        this.random = null;
    }
}
class Solution {
    public int numJewelsInStones(String jewels, String stones) {
        HashSet<Character> hash=new HashSet<>();
        for (int i = 0; i < jewels.length(); i++) {
            char ch=jewels.charAt(i);
            hash.add(ch);
        }
        int nums=0;
        for (int i = 0; i < stones.length(); i++) {
            char s=stones.charAt(i);
            if(hash.contains(s)){
                nums++;
            }
        }
        return nums;
    }
    public Node copyRandomList(Node head) {
        HashMap<Node,Node> hash=new HashMap<>();
        Node cur=head;
        while(cur!=null){
            Node node =new Node(cur.val);
            hash.put(cur,node);
            cur=cur.next;
        }
        cur=head;
        while(cur!=null){
            hash.get(cur).next=hash.get(cur.next);
            hash.get(cur).random=hash.get(cur.random);
            cur=cur.next;
        }
        return hash.get(head);
    }
    public int singleNumber(int[] nums) {
        HashSet<Integer> hash=new HashSet<>();
        for (int i = 0; i < nums.length; i++) {
            if(hash.contains(nums[i])){
                hash.remove(nums[i]);
            }else {
                hash.add(nums[i]);
            }
        }
        for (int i = 0; i < nums.length; i++) {
            if(hash.contains(nums[i])){
                return nums[i];
            }
        }
        return -1;
    }
    //
    public List<String> topKFrequent(String[] words, int k) {
        //统计每个单词出现了多少次
        HashMap<String,Integer> hash=new HashMap<>();
        for (int i = 0; i < words.length; i++) {
            if(hash.get(words[i])==null){
                hash.put(words[i],1);
            }else {
                int val=hash.get(words[i]);
                hash.put(words[i],val+1);
            }
        }
        //遍历这个数组
        //建堆 小根堆
        PriorityQueue<Map.Entry<String,Integer>> minHeap=new PriorityQueue<>(k, new Comparator<Map.Entry<String, Integer>>() {
            @Override
            public int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2) {
                if(o1.getValue().compareTo(o2.getValue())==0){
                    return o2.getKey().compareTo(o1.getKey());
                }
                return o1.getValue().compareTo(o2.getValue());
            }
        });
        //把较大的储存到这个堆中
        for (Map.Entry<String,Integer> entry: hash.entrySet()) {
            if(minHeap.size()<k){
                minHeap.offer(entry);
            }else{
                //判断根的大小进行存放
                Map.Entry<String,Integer> map=minHeap.peek();
                if(entry.getValue().compareTo(map.getValue())>0){
                    minHeap.poll();
                    minHeap.offer(entry);
                }else{
                    //必须要这行
                    //频率相同
                    if(entry.getValue().compareTo(map.getValue())==0){
                        if(map.getKey().compareTo(entry.getKey())>0){
                            minHeap.poll();
                            minHeap.offer(entry);
                        }
                    }
                }
            }
        }
        List<String> list=new ArrayList<>();
        for (int i = 0; i < k; i++) {
            list.add(minHeap.poll().getKey());
        }
        Collections.reverse(list);
        return list;
    }
}
public class Test {
    //第一个重复的数据出现
//    public static int func(int[]array){
//        HashSet<Integer> hash=new HashSet<>();
//        for (int i = 0; i < array.length; i++) {
//            if(hash.contains(array[i])){
//                return array[i];
//            }else {
//                hash.add(array[i]);
//            }
//        }
//        return -1;
//    }
    //s1需要输入的，s2是实际输出的
    public static void func(String s1,String s2){
        HashSet<Character> hashSet=new HashSet<>();
        s1=s1.toUpperCase();
        s2=s2.toUpperCase();
        for (int i = 0; i < s2.length(); i++) {
            hashSet.add(s2.charAt(i));
        }
        for (int i = 0; i < s1.length(); i++) {
            if(!hashSet.contains(s2.charAt(i))){
                System.out.println(s2.charAt(i));
                hashSet.add(s2.charAt(i));
            }
        }
    }
    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        String s1=new String();
        String s2=new String();
        while(scanner.hasNextLine()){
            s1= scanner.nextLine();
            s2= scanner.nextLine();
        }
        func(s1,s2);
    }

}
